Identities in combinatorics III: Further aspects of ordered set sorting
نویسندگان
چکیده
منابع مشابه
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a special linear ordering for any intransitive total ordered set. A new data structure called semi-heap is proposed to construct an optimal (n logn) sorting algorithm. Finally, we propose a cost-optimal parallel algorithm...
متن کاملCombinatorics of Ramanujan-Slater Type Identities
We provide the missing member of a family of four q-series identities related to the modulus 36, the other members having been found by Ramanujan and Slater. We examine combinatorial implications of the identities in this family, and of some of the identities we considered in “Identities of the Ramanujan-Slater type related to the moduli 18 and 24,” [J. Math. Anal. Appl. 344/2 (2008) 765–777].
متن کاملFirst Report of a set of Genetic Identities in Prunus Rootstocks by SSR Markers
Prunus rootstocks play an important role in modern horticulture and commercial orchards owing to their responsibility for a wide range of characters from compatibility with cultivars to adaptation to biotic and abiotic stresses. In this study, Thirty Prunus rootstock samples were tested by 25 microsatellite markers in order to identify the genetic identity and relationships among them.17 SSR ma...
متن کاملSet-syllogistics meet combinatorics
Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu 1 Dipartimento di Matematica e Geoscienze, Università di Trieste, Via Valerio 12/1, I-34127 – Trieste, Italy. email: [email protected] 2 Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, I-33100 – Udine, Italy. email: [email protected] 3 Helsinki Institute for Information Technology HIIT, Depa...
متن کاملSampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90159-6